Controller synthesis for bisimulation equivalence
نویسندگان
چکیده
منابع مشابه
Controller synthesis for bisimulation equivalence
The objective of this paper is to solve the controller synthesis problem for bisimulation equivalence in a wide variety of scenarios including discrete-event systems, nonlinear control systems, behavioral systems, hybrid systems and many others. This will be accomplished by showing that the arguments underlying proofs of existence and methods for the construction of controllers are extraneous t...
متن کاملController Synthesis for Safety and Reachability via Approximate Bisimulation
In this paper, we consider the problem of controller design using approximately bisimilar abstractions with an emphasis on safety and reachability specifications. We propose abstraction-based approaches to solve both classes of problems. We start by synthesizing a controller for an approximately bisimilar abstraction. Then, using a concretization procedure, we obtain a controller for our initia...
متن کاملStrong Splitting Bisimulation Equivalence
We present ACP, a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms for condition evaluation. We confine ourselves to finitely branching processes. This restriction makes it possible to present ACP in a concise and intuitively clear way, and to bring the notion of splitting bisimulation e...
متن کاملAxiomatising ST-Bisimulation Equivalence
A simple ST operational semantics for a process algebra is provided, by defining a set of operational rules in Plotkin’s style. This algebra comprises TCSP parallel composition, ACP sequential composition and a refinement operator, which is used for replacing an action with an entire process, thus permitting hierarchical specification of systems. We prove that ST-bisimulation equivalence is a c...
متن کاملBisimulation and Language Equivalence
One way to understand an interactive system is firmly rooted in language theory, that a system is its set of runs (or words). Properties of systems are described in a linear time temporal logic. Relationships between automata, language theory and logic are then utilised, such as the theory of ω-regular languages and Büchi automata. An alternative viewpoint is that an interactive system should b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems & Control Letters
سال: 2008
ISSN: 0167-6911
DOI: 10.1016/j.sysconle.2007.11.005